Perfect sampling for Gibbs point processes using partial rejection sampling
نویسندگان
چکیده
منابع مشابه
Perfect sampling algorithm for Schur processes
We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several fundamental combinatorial objects as special cases, such as plane partitions, tilings of Aztec diamonds, pyramid partitions and more generally steep domino tili...
متن کاملBayesian inference of genetic parameters for reproductive traits in Sistani native cows using Gibbs sampling
This study was undertaken to estimate the genetic parameters for some reproduction traits in Sistani beef cattle. The data set consisted of 1489 records of number of insemination, calving, and insemination dates in different calving was used. Reproduction traits including calving interval (CI), gestation length (GL), days open (DO), calving to first service (CTFS), first service to conception (...
متن کاملPerfect Sampling Using Bounding Chains
Bounding chains are a technique that offers three benefits to Markov chain practitioners: a theoretical bound on the mixing time of the chain under restricted conditions, experimental bounds on the mixing time of the chain that are provably accurate and construction of perfect sampling algorithms when used in conjunction with protocols such as coupling from the past. Perfect sampling algorithms...
متن کاملSplit-Merge Augmented Gibbs Sampling for Hierarchical Dirichlet Processes
The Hierarchical Dirichlet Process (HDP) model is an important tool for topic analysis. Inference can be performed through a Gibbs sampler using the auxiliary variable method. We propose a splitmerge procedure to augment this method of inference, facilitating faster convergence. Whilst the incremental Gibbs sampler changes topic assignments of each word conditioned on the previous observations ...
متن کاملEfficient Sampling for k-Determinantal Point Processes
Determinantal Point Processes (Dpps) are elegant probabilistic models of repulsion and diversity over discrete sets of items. But their applicability to large sets is hindered by expensive cubic-complexity matrix operations for basic tasks such as sampling. In light of this, we propose a new method for approximate sampling from discrete k-Dpps. Our method takes advantage of the diversity proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2020
ISSN: 1350-7265
DOI: 10.3150/19-bej1184